منابع مشابه
Fighting Cheating in P2P-based MMVEs with Disjoint Path Routing
In a P2P-based Massively Multiuser Virtual Environment (MMVE) where nodes cannot be trusted, replicating data on multiple nodes is a possibility to increase the reliability to obtain correct data. Current structured P2P networks mostly place replicas in such a way that queries for the replicas travel along similar paths. A malicious node in the common part of all paths can nullify the security ...
متن کاملFault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes
Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...
متن کاملA Multi-path Routing Scheme for Torus-based Nocs
In Networks-on-Chip (NoC) designs, crosstalk noise has become a serious issue which may cause the communication channel unreliable. The crosstalk problem can be mitigated by wide spacing of serial lines. However, the wider spacing of serial lines will reduce the number of the lines, thus reduce the data throughput. In this paper, a new fully adaptive Multi-Path Routing (MPR) scheme is proposed ...
متن کاملComplexity of pairwise shortest path routing in the grid
In parallel and distributed systems many communications take place concurrently. The efficient delivery of all the messages depends on the routing algorithms as well as the underlying interconnection network topology. The grid is a planar network topology that lends itself for efficient VLSI implementation and therefore is of interest for theoretical analysis. Frequently, networks and switches ...
متن کاملConstructing Pairwise Disjoint Paths with
Let P be a simple polygon and let f(ui; u 0 i)g be m pairs of distinct vertices of P where for every distinct i; j m, there exist pairwise disjoint paths connecting ui to u 0 i and uj to u 0 j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u 0 i for i = 1; : : : ; m, with minimal total number of line segments. We give an approximation algorithm which in O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2018
ISSN: 1424-8220
DOI: 10.3390/s18113912